Approximations by Ideal Minimal Structure with Chemical Application

نویسندگان

چکیده

The theory of rough set represents a non-statistical methodology for analyzing ambiguity and imprecise information. It can be characterized by two crisp sets, named the upper lower approximations that are used to determine boundary region accurate measure any subset. This article endeavors achieve best approximation highest accuracy degree using minimal structure space via ideal . novel approach (indicated ) modifies diminish enhance accuracy. suggested method is more than Pawlak’s EL-Sharkasy techniques. Via illustrated examples, several remarkable results these notions obtained some their properties established. Several sorts near open (resp. closed) sets based on studied. Furthermore, connections between assorted kinds near-open in deduced. advantages disadvantages proposed compared previous ones examined. An algorithm MATLAB framework decision-making problems verified. Finally, chemical application classification amino acids (AAs) treated highlight significance applying approximation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Minimal Approximations of Modules

Let R be a ring and consider the category ModR of (right) R-modules. Given a class C ofR-modules, a morphismM → N in ModR is called a left C-approximation of M provided that N belongs to C and the induced morphism HomR(N,C) → HomR(M,C) is surjective for every C in C. This concept has been introduced by Auslander and Smalø [2], and independently by Enochs [5]. Approximations arise naturally in v...

متن کامل

A complete algorithm to find exact minimal polynomial by approximations

We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on obtaining an exact rational number from its approximation. The algorithm is applicable for finding exact minimal polynomial of an algebraic number by its approxi...

متن کامل

M-IDEAL STRUCTURE IN UNIFORM ALGEBRAS

It is proved that if A is aregular uniform algebra on a compact Hausdorff space X in which every closed ideal is an M-ideal, then A = C(X).

متن کامل

Stable Approximations of a Minimal Surface Problem with Variational Inequalities

In this paper we develop a new approach for the stable approximation of a minimal surface problem associated with a relaxed Dirichlet problem in the space BV(Ω) of functions of bounded variation. The problem can be reformulated as an unconstrained minimization problem of a functional J on BV(Ω) defined by J (u) = A(u) + ∫ ∂Ω |Tu − φ|, where A(u) is the “area integral” of u with respect to Ω, T ...

متن کامل

Uniqueness of chemical equilibria in ideal mixtures of ideal gases

We prove the uniqueness of chemical equilibrium for an ideal mixture of ideal gases in a closed, spatially homogeneous volume. Uniqueness, a fundamental issue of chemical physics, is incompletely justified in textbooks and much of the scientific literature. We first reproduce a little known proof by Zel’dovich and show in a more direct fashion than originally presented that a unique equilibrium...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Intelligent Automation and Soft Computing

سال: 2023

ISSN: ['2326-005X', '1079-8587']

DOI: https://doi.org/10.32604/iasc.2023.034234